An Assume/Guarantee Based Compositional Calculus for Hybrid CSP

نویسندگان

  • Shuling Wang
  • Naijun Zhan
  • Dimitar P. Guelev
چکیده

HCSP (Hybrid CSP) extends CSP to describe interacting continuous and discrete dynamics. The concurrency with synchronous communications, timing constructs, interrupts, differential equations, and so on, make the behavior of HCSP difficult to specify and verify. In this paper, we propose a Hoare-style calculus for reasoning about HCSP. The calculus includes Duration Calculus formulas to record process execution history and reason about real-time properties and continuous evolution, and dedicated predicate symbols to specify communication traces and readiness of process actions in a way which enables synchronisation to be handled compositionally by using assume/guarantee reasoning. keywords: Hybrid Systems, Duration Calculus, Hoare Logic, HCSP, Compositionality, Assume/Guarantee

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assume-Guarantee Abstraction Refinement Meets Hybrid Systems

Compositional verification techniques in the assumeguarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We inte...

متن کامل

Super-Dense Computation in Verification of Hybrid CSP Processes

Hybrid Communicating Sequential Processes (HCSP) extends CSP to include differential equations and interruptions. We feel comfortable in our experience with HCSP to model scenarios of the Level 3 of Chinese Train Control System (CTCS-3), and to define a formal semantics for Simulink. The Hoare style calculus of [5] proposes a calculus to verify HCSP processes. However it has an error with respe...

متن کامل

Compositional Modelling and Reasoning in an Institution for Processes and Data

The language Csp-Casl combines specifications of data and processes. We give an institution based semantics to Csp-Casl that allows us to re-use the institution independent structuring mechanisms of Casl. Furthermore, we extend Csp-Casl with a notion of refinement that reconciles the differing philosophies behind the refinement notions for Csp and Casl. We develop a compositional proof calculus...

متن کامل

Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus

Deductive methods for the verification of hybrid systems vary on the format of statements in correctness proofs. Building on the example of Hoare triple-based reasoning, we have investigated several such methods for systems described in Hybrid CSP, each based on a different assertion language, notation for time, and notation for proofs, and each having its pros and cons with respect to expressi...

متن کامل

Compositional and Assume-Guarantee Reasoning for Switching Linear Systems

Modular modeling techniques play an important role in the analysis of engineering processes as well as in control applications. While individual components of aggregated models can be relatively simple, complexity increases significantly when interconnections are considered. To address the problem of complexity explosion, simulation relations can be employed to abstract system behaviors by lowe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012